#include<iostream>
#include<vector>
#include<unordered_map>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_set>
#include<bits/stdc++.h>
#define fi first
#define se second
#define SIZE(x) ((int)x.size())
#define out(x) cerr<<#x<<" = "<<(x)<<endl;
#define MP(a,b) make_pair(a,b)
using namespace std;
typedef long long ll;
#define VI vector<int>
#define VVI vector< vector<int> >
#define VL vector<ll>
#define VVL vector<VL >
#define VC vector<char>
#define PI pair<int,int>
#define PL pair<ll,ll>
#define EPS 0.0000001


inline int lson(int x){return x<<1;}
inline int rson(int x){return (x<<1)|1;}

inline int read()
{
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}

template<typename T> 
inline void read(T &x){
	x=0;T f=1;char ch;
	do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
	do x=x*10+ch-'0',ch=getchar();while(ch<='9'&&ch>='0');x*=f;
}

struct node{int a,b,c;};
//#define INF 5340172838076674L
#define INF 1000000000
#define MOD 998244353


ll fact[1000005];
int bit[1000005];
int n;
void add(int x,int v){
	while(x<=n){
		bit[x]+=v;
		x+=x&-x;
	}
}
int que(int x){
	int res=0;
	while(x){
		res+=bit[x];
		x-=x&-x;
	}
	return res;
}
//P5367
int main(){
    #ifdef BUG
    freopen("a.in","r",stdin);
    #endif
	memset(bit,0,sizeof bit);
	n=read();
	ll res=0;
	fact[0]=1;
	for(int i=1;i<=n;i++)fact[i]=(i*fact[i-1])%MOD;
	for(int i=1;i<=n;i++)add(i,1);
	for(int i=1;i<=n;i++){
		int tmp=read();
		add(tmp,-1);
		res=(res+que(tmp-1)*fact[n-i])%MOD;
	}
	cout<<(res+1)<<endl;
}
